Load Balancing for Adaptively Refined Grids
نویسنده
چکیده
The solution of partial differential equations on a parallel computer is usually done by a data parallel approach. The grid is partitioned and mapped onto the processors. However, partitioning of unstructured meshes and adaptively refined meshes in general is an NP -hard problem and heuristics are needed. In this paper a parallelisable and cheap method based on space-filling curves is analysed. Quasi-optimal estimates are derived for partitions of adaptively refined grids.
منابع مشابه
Load-balancing for parallel adaptive unstructured grids
A parallel method for the dynamic partitioning of unstructured meshes is outlined. The method includes diffusive load-balancing techniques and an iterative optimisation technique known as relative gain optimisation which both balances the workload and attempts to minimise the interprocessor communications overhead. It can also optionally include a multilevel strategy. Experiments on a series of...
متن کاملA refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A partitioning method based on the refinement-tree is presented. This method applies to most types of grids in two and three dimensions. For triangular and tetrahedral grids, it is guaranteed to produce connected p...
متن کاملParallel Adaptively Re ned Sparse
A parallel version of a nite diierence discretization of PDEs on sparse grids is proposed. Sparse grids or hyperbolic crosspoints can be used for the eecient representation of solutions of a boundary value problem, especially in high dimensions , because the number of grid points depends only weakly on the dimension. So far only thècombination' technique for regular sparse grids was available o...
متن کاملParallel Block-structured Adaptive Mesh Refinement for Incompressible Navier-stokes Equations
The numerical simulation of fluid flow involving complex geometries is greatly limited by the spatial grid resolution required. These flows often contain small regions with complex motions, while the remaining flow is relatively smooth. Adaptive mesh refinement (AMR) enables the spatial grid to be refined in local regions that require finer grids to resolve the flow. This work describes an appr...
متن کاملDynamic mesh partitioning: a unified optimisation and load-balancing algorithm
A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new unified iterative optimisation technique which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent quality to static partitioners ...
متن کامل